/*
 * Copyright (c) 2019 TAOS Data, Inc. <jhtao@taosdata.com>
 *
 * This program is free software: you can use, redistribute, and/or modify
 * it under the terms of the GNU Affero General Public License, version 3
 * or later ("AGPL"), as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 */
#ifndef _TD_UTIL_FREE_BLOCK_H_
#define _TD_UTIL_FREE_BLOCK_H_

#include "trbtree.h"

typedef struct FreeBlock {
  SRBTreeNode node;
  int64_t     start;
  int64_t     length;

  struct FreeBlock *nextInBucket;
} FreeBlock;

FreeBlock *createFreeBlock(int start, int length);
void       destroyFreeBlock(FreeBlock *block);
void       insertFreeBlock(SRBTree *tree, FreeBlock *newBlock);
FreeBlock *findBestFitBlock(SRBTree *tree, int requestLength);
FreeBlock *popBestFitBlock(SRBTree *tree, int requestLength);
int32_t    compareFreeBlock(const SRBTreeNode *a, const SRBTreeNode *b);
void       clearAllFreeBlocks(SRBTree *tree);

#endif  // _TD_UTIL_FREE_BLOCK_H_